Noniterative solution of inverse problems by the linear least square method
نویسندگان
چکیده
منابع مشابه
Positive solution of non-square fully Fuzzy linear system of equation in general form using least square method
In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...
متن کاملpositive solution of non-square fully fuzzy linear system of equation in general form using least square method
in this paper, we propose the least-squares method for computing the positive solution of a m n fully fuzzy linear system (ffls) of equations, where m > n, based on ka man's arithmetic operations on fuzzy numbers that introduced in [18]. first, we consider all elements of coecient matrix are non-negative or non-positive. also, we obtain 1-cut of the fuzzy number vector solution of the n...
متن کاملOn the Least Squares Solution of Inverse Eigenvalue Problems
An inverse eigenvalue problem where a matrix is to be constructed from some or all of its eigenvalues may not have a real valued solution at all An approximate solution in the sense of least squares is sometimes desirable Two types of least squares problems are formulated and explored in this paper In spite of their di erent appearance the two problems are shown to be equivalent Thus one new nu...
متن کاملOn Mixed and Componentwise Condition Numbers for Moore-Penrose Inverse and Linear Least Square Problems
In this talk, we discuss the maximum number of n × n pure imaginary quaternionic solutions to the Hurwitz matrix equations given by T i T * j + T j T Abstract Let T be a bounded linear operator on a complex Hilbert space H. For 0 ≤ q ≤ 1, the
متن کاملLeast squares solution of nearly square overdetermined sparse linear systems
The solution of nearly square overdetermined linear systems is studied. The sparse QR technique is compared with two sparse LU-based techniques. Numerical tests with realworld and artificial matrices indicate that the LU techniques are more accurate for incompatible right-hand sides. Also, the amount of floating point operations required by LU techniques is approximately one half smaller than Q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2001
ISSN: 0307-904X
DOI: 10.1016/s0307-904x(01)00006-3